منابع مشابه
Overlapping modularity at the critical point of k-clique percolation
One of the most remarkable social phenomena is the formation of communities in social networks corresponding to families, friendship circles, work teams, etc. Since people usually belong to several different communities at the same time, the induced overlaps result in an extremely complicated web of the communities themselves. Thus, uncovering the intricate community structure of social network...
متن کاملk-Blocks: A Connectivity Invariant for Graphs
A k-block in a graph G is a maximal set of at least k vertices no two of which can be separated in G by fewer than k other vertices. The block number (G) of G is the largest integer k such that G has a k-block. We investigate how interacts with density invariants of graphs, such as their minimum or average degree. We further present algorithms that decide whether a graph has a k-block, or which...
متن کاملEvaluation of the field-in-field technique with lung blocks for breast tangential radiotherapy
Several studies have reported the advantages of the field-in-field (FIF) technique in breast radiotherapy, including dose reduction in the lungs by using lung field blocks. We evaluated the FIF technique with lung blocks for breast tangential radiotherapy. Sixteen patients underwent free breathing (FB) computed tomography (CT), followed by two CT procedures performed during breath hold after li...
متن کاملBlocks in cycles and k-commuting permutations
We introduce and study k-commuting permutations. One of our main results is a characterization of permutations that k-commute with a given permutation. Using this characterization, we obtain formulas for the number of permutations that k-commute with a permutation [Formula: see text], for some cycle types of [Formula: see text]. Our enumerative results are related with integer sequences in "The...
متن کاملStatistics of Blocks in k-Divisible Non-Crossing Partitions
We derive a formula for the expected number of blocks of a given size from a non-crossing partition chosen uniformly at random. Moreover, we refine this result subject to the restriction of having a number of blocks given. Furthermore, we generalize to k-divisible partitions. In particular, we find that in average the number of blocks of a k-divisible non-crossing partitions of nk elements is k...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1987
ISSN: 0095-8956
DOI: 10.1016/0095-8956(87)90060-8